Packet Routing and Job - Shop Scheduling inO ( Congestion + Dilation )
نویسندگان
چکیده
In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machines, network emulations, and job-shop scheduling.
منابع مشابه
O(congestion + Dilation) Steps
In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machines, network emulations, and job-shop scheduling.
متن کاملPacket Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps
In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machines, network emulations, and job-shop scheduling. This research was conducted while the authors w...
متن کاملPacket Routing in Networks with Long Wires
In this paper, we examine the packet routing problem for networks with wires of di ering length. We consider this problem in a network independent context, in which routing time is expressed in terms of \congestion" and \dilation" measures for a set of packet paths. We give, for any constant > 0, a randomized on-line algorithm for routing any set of N packets in O((C lg (Nd) +D lg(Nd))= lg lg(N...
متن کاملAsymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
We propose asymptotically optimal algorithms for the job shop scheduling and packet routing problems. We propose a fluid relaxation for the job shop scheduling problem in which we replace discrete jobs with the flow of a continuous fluid. We compute an optimal solution of the fluid relaxation in closed form, obtain a lower bound C,,, to the job shop scheduling problem, and construct a feasible ...
متن کاملApproximation algorithms for shop scheduling problems with minsum objective: A correction
We consider a general class of multiprocessor shop scheduling problems, preemptive or nonpreemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We present a general approximation method combining a linear programming relaxation in the operation...
متن کامل